Kinase Identification with Supervised Laplacian Regularized Least Squares
نویسندگان
چکیده
منابع مشابه
Kinase Identification with Supervised Laplacian Regularized Least Squares
Phosphorylation is catalyzed by protein kinases and is irreplaceable in regulating biological processes. Identification of phosphorylation sites with their corresponding kinases contributes to the understanding of molecular mechanisms. Mass spectrometry analysis of phosphor-proteomes generates a large number of phosphorylated sites. However, experimental methods are costly and time-consuming, a...
متن کاملSemi-supervised Laplacian regularized least squares algorithm for localization in wireless sensor networks
In this paper, we propose a new approach for localization in wireless sensor networks based on semi-supervised Laplacian regularized least squares algorithm. We consider two kinds of localization data: signal strength and pair-wise distance between nodes. When nodes are close within their physical location space, their localization data vectors should be similar. We first propose a solution usi...
متن کاملRegularized Least-Squares Classification
We consider the solution of binary classification problems via Tikhonov regularization in a Reproducing Kernel Hilbert Space using the square loss, and denote the resulting algorithm Regularized Least-Squares Classification (RLSC). We sketch the historical developments that led to this algorithm, and demonstrate empirically that its performance is equivalent to that of the well-known Support Ve...
متن کاملRegularized Least Squares
{(xi, yi)}i=1 are the given data points, V (·) represents the loss function indicating the penalty we pay for predicting f(xi) when the true value is yi, and ‖f‖H is a Hilbert space norm regularization term with a regularization parameter λ which controls the stability of the solution and trades-off regression accuracy for a function with small norm in RKHS H. Denote by S the training set {(x1,...
متن کاملSemi-supervised Learning with Regularized Laplacian
We study a semi-supervised learning method based on the similarity graph and Regularized Laplacian. We give convenient optimization formulation of the Regularized Laplacian method and establish its various properties. In particular, we show that the kernel of the method can be interpreted in terms of discrete and continuous time random walks and possesses several important properties of proximi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2015
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0139676